Swift chiral quantum walks

نویسندگان

چکیده

A continuous-time quantum walk (CTQW) is sedentary if the return probability in starting vertex close to one at all times. Recent results imply that, when from a maximal degree vertex, CTQW dynamics generated by Laplacian and adjacency matrices are typically sedentary. In this paper, we show that addition of appropriate complex phases edges graph, defining chiral CTQW, can cure sedentarity lead swift walks type, which bring zero shortest time possible. We also provide no-go theorem for CTQWs type. Our first, general characterization tasks cannot be achieved with CTQWs.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-Avoiding chiral Walks

We describe a simple, discrete model of deterministic chiral motion on a square lattice. The model is based on rotating walkers with trailing tails spanning L lattice bonds. These tail segments cannot overlap and their leading A segments cannot be crossed. As prescribed by their chirality, walkers must turn if possible, or go straight, or else correct earlier steps recursively. The resulting mo...

متن کامل

Quantum Walks

Quantum walks can be considered as a generalized version of the classical random walk. There are two classes of quantum walks, that is, the discrete-time (or coined) and the continuous-time quantum walks. This manuscript treats the discrete case in Part I and continuous case in Part II, respectively. Most of the contents are based on our results. Furthermore, papers on quantum walks are listed ...

متن کامل

Quantum walks and quantum computation

The field of quantum information applies the concepts of quantum physics to problems in computer science, and shows great potential for allowing efficient computation. In this thesis I concentrate on a particular quantum information theoretic tool known as the quantum walk. There are two widely studied versions of the quantum walk, the continuous time walk, and the discrete time walk. The discr...

متن کامل

Quantum Walks, Quantum Gates, and Quantum Computers

The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a singleand multi-excitation coding, and for more genera...

متن کامل

Symmetry in Quantum Walks

A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk reaches an ending condition. We derive an expression for hitting time using superoperators, and numerically evaluate it for the walk on the hypercube for various ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2023

ISSN: ['1873-1856', '0024-3795']

DOI: https://doi.org/10.1016/j.laa.2023.05.007